Corrigendum: On multiperiodic words
نویسنده
چکیده
An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl. 40 (2006) 583–591]. It is designed to calculate the maximum length of a nontrivial word with a given set of periods. Mathematics Subject Classification. 68R15. The purpose of this contribution is to fill a gap in the algorithm presented in my paper [1] as Theorem 2. The theorem contains a formula that is supposed to yield the length LP of the longest nontrivial multiperiodic word, that is, the longest word having a given set P of coprime periods and not the period one. The formula reads as follows: LP = mn−1 − 1 + n−1 ∑
منابع مشابه
Corrigendum to "On $(sigma, tau)$-module extension Banach algebras"
In this corrigendum, we give a correction of one result in reference [1].
متن کاملCorrigendum notice: Protective Effect of Interval Exercise Training with Different Intensity and Alpha-Lipoic Acid Supplement on Nav1.3 Protein in Soleus Muscle of Diabetic Rats
Corrigendum notice: Protective Effect of Interval Exercise Training with Different Intensity and Alpha-Lipoic Acid Supplement on Nav1.3 Protein in Soleus Muscle of Diabetic Rats Seyedeh Fatemeh Fatemi1, Seyed Abdollah Hashemvarzi1, Amin Farzaneh Hesari1 1Department of Exercise Physiology, Sari Branch, Islamic Azad University, Sari, Iran. *Corresponding author: Tel: 09111160278, email: ...
متن کاملOn Multiperiodic Infinite Recursions and Their Finite Core
We define multiperiodic infinite recursions and show that for such a recursion there is a finite linear recursion, the finite core, which gives almost the same type of recur-sion except for a different offset. Moreover, if we add the sequences produced by all multiperiodic infinite recursions with a given finite core, we almost obtain a multiple of the sequence associated with the finite core.
متن کاملQuantum Automata for some Multiperiodic Languages
We exhibit small size measure-once one-way quantum finite automata (mo-1qfa’s) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa’s whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa’s whose size logarithmically depends on the periods and polynomially on the inverse of the error ...
متن کاملOn Multiperiodic Words * ˇ Stěpán Holub
In this note we consider the longest word, which has periods p1, . . . , pn, and does not have the period gcd(p1, . . . , pn). The length of such a word can be established by a simple algorithm. We give a short and natural way to prove that the algorithm is correct. We also give a new proof that the maximal word is a palindrome. Mathematics Subject Classification. 68R15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RAIRO - Theor. Inf. and Applic.
دوره 45 شماره
صفحات -
تاریخ انتشار 2011